A generalized Levinson algorithm for covariance extension with application to multiscale autoregressive modeling

نویسندگان

  • Austin B. Frakt
  • Hanoch Lev-Ari
  • Alan S. Willsky
چکیده

Efficient computation of extensions of banded, partially known covariance matrices is provided by the classical Levinson algorithm. One contribution of this paper is the introduction of a generalization of this algorithm that is applicable to a substantially broader class of extension problems. This generalized algorithm can compute unknown covariance elements in any order that satisfies certain graph-theoretic properties, which we describe. This flexibility, which is not provided by the classical Levinson algorithm, is then harnessed in a second contribution of this paper, the identification of a multiscale autoregressive (MAR) model for the maximum-entropy (ME) extension of a banded, partially known covariance matrix. The computational complexity of MAR model identification is an order of magnitude below that of explicitly computing a full covariance extension and is comparable to that required to build a standard autoregressive (AR) model using the classical Levinson algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forecasting Gold Price Changes: Application of an Equipped Artificial Neural Network

The forecast of fluctuations and prices is the major concern in financial markets. Thus, developing an accurate and robust forecasting decision model is critically favorable to the investors. As gold has shown a special capability to smooth inflation fluctuations, governors use gold as a price controlling lever. Thus, more information about future gold price trends will help to make the firm de...

متن کامل

Multiscale Autoregressive Models and Wavelets: Extended Version

The multiscale autoregressive (MAR) framework was introduced to support the development of optimal multiscale statistical signal processing. Its power resides in the fast and exible algorithms to which it leads. While the MAR framework was originally motivated by wavelets, the link between these two worlds has been previously established only in the simple case of the Haar wavelet. The rst cont...

متن کامل

Periodic Levinson-Durbin algorithm for entropy maximization

One gives a recursive algorithm for the computation of the first and second order derivatives of the entropy of a periodic autoregressive process with respect to the autocovariances. It is an extension of the periodic LevinsonDurbin algorithm. The algorithm has been developed for use at one of the steps of an entropy maximization method developed by the authors. Numerical examples of entropy ma...

متن کامل

Multi-Scale Autoregressive Processes

In many applications (e.g. recognition of geophysical and biomedical signals and multiscale analysis of images), it is of interest to analyze and recognize phenomena occuring at different scales. The recently introduced wavelet transforms provide a time-and-scale decomposition of signals that offers the possibility of such analysis. At present, however, there is no corresponding statistical fra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2003